Quadratic Privacy-Signaling Games and the MMSE Information Bottleneck Problem for Gaussian Sources
نویسندگان
چکیده
We investigate a privacy-signaling game problem in which sender with privacy concerns observes pair of correlated random vectors are modeled as jointly Gaussian. The aims to hide one these and convey the other whereas objective receiver is accurately estimate both vectors. analyze conflicting objectives theoretic framework quadratic costs where depending on commitment conditions (of sender), we consider Nash or Stackelberg (Bayesian persuasion) equilibria. show that payoff dominant equilibrium among all admissible policies attained by set explicitly characterized linear policies. also coincides equilibrium. formulate information bottleneck within our under mean squared error distortion criterion setup has further restriction only variables observed at sender. this MMSE Gaussian Information Bottleneck Problem admits solution paper. provide explicit when optimal solutions, solutions setup, informative noninformative.
منابع مشابه
Distributed Information Bottleneck Method for Discrete and Gaussian Sources
We study the problem of distributed information bottleneck, in which multiple encoders separately compress their observations in a manner such that, collectively, the compressed signals preserve as much information as possible about another signal. The model generalizes Tishby’s centralized information bottleneck method to the setting of multiple distributed encoders. We establish single-letter...
متن کاملInformation Bottleneck for Gaussian Variables
The problem of extracting the relevant aspects of data was addressed through the information bottleneck (IB) method, by (soft) clustering one variable while preserving information about another relevance variable. An interesting question addressed in the current work is the extension of these ideas to obtain continuous representations that preserve relevant information, rather than discrete clu...
متن کاملMeta-Gaussian Information Bottleneck
We present a reformulation of the information bottleneck (IB) problem in terms of copula, using the equivalence between mutual information and negative copula entropy. Focusing on the Gaussian copula we extend the analytical IB solution available for the multivariate Gaussian case to distributions with a Gaussian dependence structure but arbitrary marginal densities, also called meta-Gaussian d...
متن کاملSparse meta-Gaussian information bottleneck
We present a new sparse compression technique based on the information bottleneck (IB) principle, which takes into account side information. This is achieved by introducing a sparse variant of IB which preserves the information in only a few selected dimensions of the original data through compression. By assuming a Gaussian copula we can capture arbitrary non-Gaussian margins, continuous or di...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2022
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2022.3177258